import numpy as np
def knapSack(W, wt, val, n):
 
    # Base Case
    if n == 0 or W == 0:
        return 0
 
    # If weight of the nth item is
    # more than Knapsack of capacity W,
    # then this item cannot be included
    # in the optimal solution
    if (wt[n-1] > W):
        return knapSack(W, wt, val, n-1)
 
    # return the maximum of two cases:
    # (1) nth item included
    # (2) not included
    else:
        return max(
            val[n-1] + knapSack(
                W-wt[n-1], wt, val, n-1),
            knapSack(W, wt, val, n-1))

with open("table.txt",encoding = 'utf-8') as f:
    table = np.loadtxt("table.txt", int, delimiter = ',')
    wt = table[:,0]
    val = table[:,1]

    print(wt)
    print(val)
    W = 10
    n = len(table)
    val = knapSack(W, wt, val, n)
    print(val)

